0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n015.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Aug  9 02:49:56 EDT 2022
0.14/0.35	% CPUTime    : 
0.20/0.48	Running higher-order on 8 cores theorem proving
0.20/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.48	# Version: 3.0pre003-ho
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNSSA.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting sh3 with 600s (5) cores
0.20/0.50	# Starting lpo8_s with 120s (1) cores
0.20/0.50	# Starting sh2lt with 120s (1) cores
0.20/0.50	# Starting sh2l with 120s (1) cores
0.20/0.50	# sh2lt with pid 9575 completed with status 0
0.20/0.50	# Result found by sh2lt
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNSSA.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting sh3 with 600s (5) cores
0.20/0.50	# Starting lpo8_s with 120s (1) cores
0.20/0.50	# Starting sh2lt with 120s (1) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.20/0.50	# ...ProofStateSinE()=1/3
0.20/0.50	# Search class: HGUNF-FFSF22-SSSFFMBN
0.20/0.50	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.20/0.50	# Starting new_ho_10 with 73s (1) cores
0.20/0.50	# new_ho_10 with pid 9581 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNSSA.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting sh3 with 600s (5) cores
0.20/0.50	# Starting lpo8_s with 120s (1) cores
0.20/0.50	# Starting sh2lt with 120s (1) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
0.20/0.50	# ...ProofStateSinE()=1/3
0.20/0.50	# Search class: HGUNF-FFSF22-SSSFFMBN
0.20/0.50	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.20/0.50	# Starting new_ho_10 with 73s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_22, type, cK: (a > $o) > a > $o).
0.20/0.50	thf(decl_23, type, esk1_2: (a > $o) > (a > $o) > a).
0.20/0.50	thf(decl_24, type, esk2_0: a).
0.20/0.50	thf(decl_25, type, epred1_0: a > $o).
0.20/0.50	thf(decl_26, type, epred2_0: a > $o).
0.20/0.50	thf(decl_27, type, epred3_1: a > a > $o).
0.20/0.50	thf(decl_28, type, esk3_2: a > (a > $o) > a).
0.20/0.50	thf(decl_29, type, epred4_1: a > a > $o).
0.20/0.50	thf(decl_30, type, esk4_2: a > (a > $o) > a).
0.20/0.50	thf(cTHM116_1SS, conjecture, (![X1:a]:(((cK @ (cK @ (^[X2:a]:(?[X3:a > $o]:(((X3 @ X2)&![X4:a]:(((cK @ X3 @ X4)<=(X3 @ X4)))))))) @ X1)<=(cK @ (^[X2:a]:(?[X3:a > $o]:(((X3 @ X2)&![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4))))))) @ X1)))<=![X5:a > $o, X6:a > $o]:((![X1:a]:(((X6 @ X1)<=(X5 @ X1)))=>![X1:a]:(((cK @ X5 @ X1)=>(cK @ X6 @ X1)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM116_1SS)).
0.20/0.50	thf(c_0_1, negated_conjecture, ~((![X5:a > $o, X6:a > $o]:((![X1:a]:(((X5 @ X1)=>(X6 @ X1)))=>![X1:a]:(((cK @ X5 @ X1)=>(cK @ X6 @ X1)))))=>![X1:a]:(((cK @ (^[Z0:a]:(?[X3:a > $o]:(((X3 @ Z0)&![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4))))))) @ X1)=>(cK @ (cK @ (^[Z0:a]:(?[X3:a > $o]:(((X3 @ Z0)&![X4:a]:(((cK @ X3 @ X4)<=(X3 @ X4)))))))) @ X1))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_1SS])])])).
0.20/0.50	thf(c_0_2, negated_conjecture, ![X12:a > $o, X13:a > $o, X15:a]:(((((X12 @ (esk1_2 @ X12 @ X13))|(~(cK @ X12 @ X15)|(cK @ X13 @ X15)))&(~(X13 @ (esk1_2 @ X12 @ X13))|(~(cK @ X12 @ X15)|(cK @ X13 @ X15))))&((cK @ (^[Z0:a]:(?[X3:a > $o]:(((X3 @ Z0)&![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4))))))) @ esk2_0)&~(cK @ (cK @ (^[Z0:a]:(?[X3:a > $o]:(((X3 @ Z0)&![X4:a]:(((cK @ X3 @ X4)<=(X3 @ X4)))))))) @ esk2_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.20/0.50	thf(c_0_3, plain, ![X22:a]:(((epred2_0 @ X22)<=>?[X20:a > $o]:(((X20 @ X22)&![X21:a]:(((X20 @ X21)=>(cK @ X20 @ X21))))))), introduced(definition)).
0.20/0.50	thf(c_0_4, plain, ![X29:a, X31:a, X32:a, X33:a > $o]:(((((epred4_1 @ X29 @ X29)|~(epred1_0 @ X29))&(~(epred4_1 @ X29 @ X31)|(cK @ (epred4_1 @ X29) @ X31)|~(epred1_0 @ X29)))&(((X33 @ (esk4_2 @ X32 @ X33))|~(X33 @ X32)|(epred1_0 @ X32))&(~(cK @ X33 @ (esk4_2 @ X32 @ X33))|~(X33 @ X32)|(epred1_0 @ X32))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])])])])).
0.20/0.50	thf(c_0_5, plain, ![X23:a, X25:a, X26:a, X27:a > $o]:(((((epred3_1 @ X23 @ X23)|~(epred2_0 @ X23))&(~(epred3_1 @ X23 @ X25)|(cK @ (epred3_1 @ X23) @ X25)|~(epred2_0 @ X23)))&(((X27 @ (esk3_2 @ X26 @ X27))|~(X27 @ X26)|(epred2_0 @ X26))&(~(cK @ X27 @ (esk3_2 @ X26 @ X27))|~(X27 @ X26)|(epred2_0 @ X26))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])).
0.20/0.50	thf(c_0_6, negated_conjecture, (((cK @ epred2_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
0.20/0.50	thf(c_0_7, plain, ![X3:a > $o, X1:a]:(((epred1_0 @ X1)|~((cK @ X3 @ (esk4_2 @ X1 @ X3)))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.50	thf(c_0_8, plain, ![X2:a, X1:a]:(((cK @ (epred3_1 @ X1) @ X2)|~((epred3_1 @ X1 @ X2))|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.50	thf(c_0_9, plain, ![X3:a > $o, X1:a]:(((X3 @ (esk4_2 @ X1 @ X3))|(epred1_0 @ X1)|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.50	thf(c_0_10, negated_conjecture, ![X5:a > $o, X3:a > $o, X1:a]:(((cK @ X3 @ X1)|~((X3 @ (esk1_2 @ X5 @ X3)))|~((cK @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_11, plain, ![X2:a, X1:a]:(((cK @ (epred4_1 @ X1) @ X2)|~((epred4_1 @ X1 @ X2))|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.50	thf(c_0_12, negated_conjecture, ![X5:a > $o, X3:a > $o, X1:a]:(((X3 @ (esk1_2 @ X3 @ X5))|(cK @ X5 @ X1)|~((cK @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_13, negated_conjecture, (cK @ epred2_0 @ esk2_0), inference(cn,[status(thm)],[c_0_6])).
0.20/0.50	thf(c_0_14, plain, ![X1:a, X2:a]:(((epred1_0 @ X1)|~((epred3_1 @ X2 @ X1))|~((epred2_0 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
0.20/0.50	thf(c_0_15, plain, ![X1:a]:(((epred3_1 @ X1 @ X1)|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.50	thf(c_0_16, plain, ![X1:a, X3:a > $o, X2:a]:(((cK @ X3 @ X1)|~((X3 @ (esk1_2 @ (epred4_1 @ X2) @ X3)))|~((epred4_1 @ X2 @ X1))|~((epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.20/0.50	thf(c_0_17, plain, ![X1:a]:(((epred4_1 @ X1 @ X1)|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.50	thf(c_0_18, plain, ![X3:a > $o, X1:a]:(((epred2_0 @ X1)|~((cK @ X3 @ (esk3_2 @ X1 @ X3)))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.50	thf(c_0_19, plain, ![X3:a > $o, X1:a]:(((X3 @ (esk3_2 @ X1 @ X3))|(epred2_0 @ X1)|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.50	thf(c_0_20, plain, ![X3:a > $o, X2:a, X1:a]:(((epred4_1 @ X1 @ (esk1_2 @ (epred4_1 @ X1) @ X3))|(cK @ X3 @ X2)|~((epred4_1 @ X1 @ X2))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_12, c_0_11])).
0.20/0.50	thf(c_0_21, negated_conjecture, ![X3:a > $o]:(((cK @ X3 @ esk2_0)|~((X3 @ (esk1_2 @ epred2_0 @ X3))))), inference(spm,[status(thm)],[c_0_10, c_0_13])).
0.20/0.50	thf(c_0_22, plain, ![X1:a]:(((epred1_0 @ X1)|~((epred2_0 @ X1)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.20/0.50	thf(c_0_23, negated_conjecture, ![X3:a > $o]:(((epred2_0 @ (esk1_2 @ epred2_0 @ X3))|(cK @ X3 @ esk2_0))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.20/0.50	thf(c_0_24, plain, ![X3:a > $o, X1:a]:(((cK @ X3 @ X1)|~((X3 @ (esk1_2 @ (epred4_1 @ X1) @ X3)))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.20/0.50	thf(c_0_25, plain, ![X1:a, X2:a]:(((epred2_0 @ X1)|~((epred4_1 @ X2 @ X1))|~((epred1_0 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_11]), c_0_19])).
0.20/0.50	thf(c_0_26, plain, ![X3:a > $o, X1:a]:(((epred4_1 @ X1 @ (esk1_2 @ (epred4_1 @ X1) @ X3))|(cK @ X3 @ X1)|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_20, c_0_17])).
0.20/0.50	thf(c_0_27, plain, ![X19:a]:(((epred1_0 @ X19)<=>?[X17:a > $o]:(((X17 @ X19)&![X18:a]:(((cK @ X17 @ X18)<=(X17 @ X18))))))), introduced(definition)).
0.20/0.50	thf(c_0_28, plain, (cK @ epred1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])).
0.20/0.50	thf(c_0_29, plain, ![X1:a]:(((cK @ epred1_0 @ X1)|~((epred2_0 @ (esk1_2 @ (epred4_1 @ X1) @ epred1_0)))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_24, c_0_22])).
0.20/0.50	thf(c_0_30, plain, ![X3:a > $o, X1:a]:(((epred2_0 @ (esk1_2 @ (epred4_1 @ X1) @ X3))|(cK @ X3 @ X1)|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.20/0.50	thf(c_0_31, negated_conjecture, ~((((cK @ (cK @ epred1_0) @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_27])).
0.20/0.50	thf(c_0_32, negated_conjecture, ![X3:a > $o]:(((cK @ X3 @ esk2_0)|~((X3 @ (esk1_2 @ epred1_0 @ X3))))), inference(spm,[status(thm)],[c_0_10, c_0_28])).
0.20/0.50	thf(c_0_33, plain, ![X1:a]:(((cK @ epred1_0 @ X1)|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.20/0.50	thf(c_0_34, negated_conjecture, ~((cK @ (cK @ epred1_0) @ esk2_0)), inference(cn,[status(thm)],[c_0_31])).
0.20/0.50	thf(c_0_35, negated_conjecture, ~((epred1_0 @ (esk1_2 @ epred1_0 @ (cK @ epred1_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34])).
0.20/0.50	thf(c_0_36, negated_conjecture, ![X3:a > $o]:(((epred1_0 @ (esk1_2 @ epred1_0 @ X3))|(cK @ X3 @ esk2_0))), inference(spm,[status(thm)],[c_0_12, c_0_28])).
0.20/0.50	thf(c_0_37, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_34]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 3
0.20/0.50	# Removed by relevancy pruning/SinE    : 2
0.20/0.50	# Initial clauses                      : 12
0.20/0.50	# Removed in clause preprocessing      : 0
0.20/0.50	# Initial clauses in saturation        : 12
0.20/0.50	# Processed clauses                    : 96
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 21
0.20/0.50	# ...remaining for further processing  : 75
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 1
0.20/0.50	# Backward-rewritten                   : 0
0.20/0.50	# Generated clauses                    : 172
0.20/0.50	# ...of the previous two non-redundant : 151
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 5
0.20/0.50	# Paramodulations                      : 170
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 60
0.20/0.50	#    Positive orientable unit clauses  : 2
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 3
0.20/0.50	#    Non-unit-clauses                  : 55
0.20/0.50	# Current number of unprocessed clauses: 76
0.20/0.50	# ...number of literals in the above   : 316
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 15
0.20/0.50	# Clause-clause subsumption calls (NU) : 536
0.20/0.50	# Rec. Clause-clause subsumption calls : 275
0.20/0.50	# Non-unit clause-clause subsumptions  : 27
0.20/0.50	# Unit Clause-clause subsumption calls : 0
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 0
0.20/0.50	# BW rewrite match successes           : 0
0.20/0.50	# Condensation attempts                : 96
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 4890
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.012 s
0.20/0.50	# System time              : 0.003 s
0.20/0.50	# Total time               : 0.015 s
0.20/0.50	# Maximum resident set size: 1944 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.013 s
0.20/0.50	# System time              : 0.006 s
0.20/0.50	# Total time               : 0.018 s
0.20/0.50	# Maximum resident set size: 1716 pages
0.20/0.50	EOF